Gödel's Incompleteness Theorem

نویسنده

  • Vladimir A. Uspensky
چکیده

There are some topics in mathematics which, although enjoying a certain fame, have traditionally been considered either too complicated or of insufficient importance to be included in the core mathematical curriculum. Customarily, such subjects are relegated to optional units of the syllabus, independent study projects, seminar papers, and math club talks. Among such topics are several which remain in this nebulous status only because of inertia. An example is Godel’s incompleteness theorem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Results of a 14-Year Effort to Generalize Gödel’s Second Incompleteness Theorem and Explore Its Partial Exceptions

The Second Incompleteness Theorem states that axiom systems of sufficient strength are unable to verify their own consistency. Part of the reason that Gödel's theorem has fascinated logicians is that it almost defies common sense. This is because when human beings cogitate, they implicitly presume that thinking is a useful process. However, this tacit assumption would initially appear to presum...

متن کامل

Gödel's Incompleteness Theorems: A Revolutionary View of the Nature of Mathematical Pursuits

The work of the mathematician Kurt Gödel changed the face of mathematics forever. His famous incompleteness theorem proved that any formalized system of mathematics would always contain statements that were undecidable, showing that there are certain inherent limitations to the way many mathematicians studies mathematics. This paper provides a history of the mathematical developments that laid ...

متن کامل

Gödel's Incompleteness Theorems

Gödel’s two incompleteness theorems [2] are formalised, following a careful presentation by Świerczkowski [3], in the theory of hereditarily finite sets. This represents the first ever machine-assisted proof of the second incompleteness theorem. Compared with traditional formalisations using Peano arithmetic [1], coding is simpler, with no need to formalise the notion of multiplication (let alo...

متن کامل

A Machine-Assisted Proof of Gödel's Incompleteness theorems for the Theory of Hereditarily Finite Sets

A formalization of Gödel’s incompleteness theorems using the Isabelle proof assistant is described. This is apparently the first mechanical verification of the second incompleteness theorem. The work closely follows Świerczkowski (2003), who gave a detailed proof using hereditarily finite set theory. The adoption of this theory is generally beneficial, but it poses certain technical issues that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 130  شماره 

صفحات  -

تاریخ انتشار 1994